A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

Potential for rice straw ethanol production in the Mekong Delta,Vietnam

This study is to evaluate the potential for development of a cellulosic ethanol facility in Vietnam. Rice straw is abundant in Vietnam and highly concentrated in the Mekong Delta, where about 26 Mt year⁻¹ of rice straw has been yearly produced. To minimize the overall production cost (PC) of ethanol from rice straw, it is crucial to choose the optimal facility size. The delivered cost of rice straw varied from 20.5 to 65.4 $ dry t⁻¹ depending on transportation distance. The Mekong Delta has much lower rice straw prices compared with other regions in Vietnam because of high density and quantity of rice straw supply. Thus, this region has been considered as the most suitable location for deploying ethanol production in Vietnam. The optimal plant size of ethanol production in the region was estimated up to 200 ML year⁻¹. The improvement in solid concentration of material in the hydrothermal pre-treatment step and using residues for power generation could substantially reduce the PC in Vietnam, where energy costs account for the second largest contribution to the PC, following only enzyme costs. The potential for building larger ethanol plants with low rice straw costs can reduce ethanol production costs in Vietnam. The current estimated production cost for an optimal plant size of 200 ML year⁻¹ was 1.19 $ L⁻¹. For the future scenario, considering improvements in pre-treatment, enzyme hydrolysis steps, specific enzyme activity, and applying residues for energy generation, the ethanol production cost could reduce to 0.45 $ L⁻¹ for a plant size of 200 ML year⁻¹ in Vietnam. These data indicated that the cost-competitiveness of ethanol production could be realized in Vietnam with future improvements in production technologies.     

A model for semiconductor quantum dot molecule based on the current spin density functional theory

Based on the current spin density functional theory, a theoretical model of three vertically aligned semiconductor quantum dots is proposed and numerically studied. This quantum dot molecule (QDM) model is treated with realistic hard-wall confinement potential and external magnetic field in three-dimensional setting. Using the effective-mass approximation with band nonparabolicity, the many-body Hamiltonian results in a cubic eigenvalue problem from a finite difference discretization. A self-consistent algorithm for solving the Schrödinger-Poisson system by using the Jacobi-Davidson method and GMRES is given to illustrate the Kohn-Sham orbitals and energies of six electrons in the molecule with some magnetic fields. It is shown that the six electrons residing in the central dot at zero magnetic field can be changed to such that each dot contains two electrons with some feasible magnetic field. The Förster-Dexter resonant energy transfer may therefore be generated by two individual QDMs. This may motivate a new paradigm of Fermionic qubits for quantum computing in solid-state systems.     

相关条件下基于N-P准则的分布式检测理论研究

本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。     

Optimal Control of the Primary Drying Stage of Freeze Drying of Solutions in Vials Using Variational Calculus

The problem of operating freeze drying of pharmaceutical products in vials placed in trays of a freeze dryer to remove free water (in frozen state) at a minimum time was formulated as an optimal control problem. Two different types of freeze dryer designs were considered. In type I freeze dryer design, upper and lower plate temperatures were controlled together, while in type II freeze dryer design, upper and lower plate temperatures were controlled independently. The heat input to the material being dried and the drying chamber pressure were considered as control variables. Constraints were placed on the system state variables by the melting and scorch temperatures during primary drying stage. Necessary conditions of optimality for the primary drying stage of freeze drying process in vials are derived and presented. Furthermore, an approach for constructing the optimal control policies that would minimize the drying time for the primary drying stage was given. In order to analyze optimal control policy for the primary drying stage of the freeze-drying process in vials, a rigorous multi-dimensional unsteady state mathematical model was used. The theoretical approach presented in this work was applied in the freeze drying of skim milk. Significant reductions in the drying times of primary drying stage of freeze drying process in vials were obtained, as compared to the drying times obtained from conventional operational policies.     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

The solution of the inverse problem of gravitational potential using a set of measurements of different field elements

A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained, the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy of the solution of this system is ten times higher than when using three field elements. __________ Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007.